Existential MSO over two successors is strictly weaker than over linear orders

نویسنده

  • Christian Mathissen
چکیده

As is well-known a language of finite words, considered as labeled linear orders, is definable in monadic second-order logic (MSO) iff it is definable in the existential fragment of MSO, that is the quantifier alternation hierarchy collapses. Even more, it does not make a difference if we consider existential MSO over a linear order or a successor relation only. In this note we show that somewhat surprisingly the latter does not hold if we just add a second linear order and consider finite relational structures with two linear orders, so-called texts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separating Graph Logic from MSO

Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of Monadic Second Order Logic (MSO), with quantification over sets of edges. We show that the containment is proper by exhibiting a property that is not GL definable but is definable in MSO, even in the absence of quantification o...

متن کامل

The uniform content of partial and linear orders

The principle ADS asserts that every linear order on ω has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore [16]. We introduce the principle ADC, which asserts that every such linear order has an infinite ascending or descending chain. The two are easily seen to be equivalent o...

متن کامل

Two-Variable Logic on 2-Dimensional Structures

This paper continues the study of the two-variable fragment of first-order logic (FO2) over twodimensional structures, more precisely structures with two orders, their induced successor relations and arbitrarily many unary relations. Our main focus is on ordered data words which are finite sequences from the set Σ×D where Σ is a finite alphabet and D is an ordered domain. These are naturally re...

متن کامل

On Expressive Power of Regular Expressions over Infinite Orders

Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-ElgotTrakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in th...

متن کامل

Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree

In this thesis we study the expressive power of variants of monadic second-order logic (MSO) on infinite trees by means of automata. In particular we are interested in weak MSO and well-founded MSO, where the second-order quantifiers range respectively over finite sets and over subsets of well-founded trees. On finitely branching trees, weak and well-founded MSO have the same expressive power a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 410  شماره 

صفحات  -

تاریخ انتشار 2009